Symplectic Matroids
نویسنده
چکیده
A symplectic matroid is a collection B of k-element subsets of J = {1, 2, . . . , n, 1∗, 2∗, . . . , n∗}, each of which contains not both of i and i∗ for every i ≤ n, and which has the additional property that for any linear ordering ≺ of J such that i ≺ j implies j∗ ≺ i∗ and i ≺ j∗ implies j ≺ i∗ for all i, j ≤ n, B has a member which dominates element-wise every other member of B. Symplectic matroids are a special case of Coxeter matroids, namely the case where the Coxeter group is the hyperoctahedral group, the group of symmetries of the n-cube. In this paper we develop the basic properties of symplectic matroids in a largely self-contained and elementary fashion. Many of these results are analogous to results for ordinary matroids (which are Coxeter matroids for the symmetric group), yet most are not generalizable to arbitrary Coxeter matroids. For example, representable symplectic matroids arise from totally isotropic subspaces of a symplectic space very similarly to the way in which representable ordinary matroids arise from a subspace of a vector space. We also examine Lagrangian matroids, which are the special case of symplectic matroids where k = n, and which are equivalent to Bouchet’s symmetric matroids or 2-matroids.
منابع مشابه
Symplectic matroids, independent sets, and signed graphs
We give an independent set axiomatization of symplectic matroids, a large and important class of Coxeter matroids. As an application, we construct a new class of examples of symplectic matroids from graphs. As another application, we prove that symplectic matroids satisfy a certain “basis exchange property,” and we conjecture that this basis exchange property in fact characterizes symplectic ma...
متن کاملAn Elementary Approach to Symplectic Matroids
Newcomers to the theory of Coxeter matroids are often frustrated by the complexity of the basic de nitions. The main result of this paper is an independent set axiomatization of symplectic matroids, a large and important class of Coxeter matroids. This axiomatization provides the most elementary de nition of symplectic matroids to date. Our hope is that it will make the subject much more access...
متن کاملMatroid Homology
We construct chain complexes of matroids and Lagrangian symplectic matroids analogous to Kontsevich graph homology.
متن کاملOriented Lagrangian Orthogonal Matroid Representations
Several attempts have been made to extend the theory of matroids (here referred to as ordinary or classical matroids) to theories of more general objects, in particular the Coxeter matroids of Borovik, Gelfand and White ([7], first introduced as WP-matroids in [10]), and the ∆-matroids and (equivalent but for notation) symmetric matroids of Bouchet (see, for example, [8]). The special cases of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996